منابع مشابه
Collecting and Organizing Web Content
To collect and organize Web content today a user must make bookmarks, print whole webpages, or copy and paste pieces of webpages into a document. We present a framework for assisting the user in managing personal collections of Web content. The user interactively selects the webpage elements of interest, and the system builds an extraction pattern for those elements that is used to automaticall...
متن کاملFreePub: Collecting and Organizing Scientific Material Using Mindmaps
This paper presents a creativity support tool, called FreePub, to collect and organize scientific material using mindmaps. Mindmaps are visual, graph-based represenations of concepts, ideas, notes, tasks, etc. They generally take a hierarchical or tree branch format, with ideas branching into their subsections. FreePub supports creativity cycles. A user starts such a cycle by setting up her dom...
متن کاملInteraction Techniques for Automating Collecting and Organizing Personal Web Content
Interaction Techniques for Automating Collecting and Organizing Personal Web Content Lubomira A. Dontcheva Co-Chairs of the Supervisory Committee: Affiliate Faculty Michael F. Cohen Department of Computer Science & Engineering Professor David H. Salesin Department of Computer Science & Engineering The growth of the World Wide Web has led to a dramatic increase in accessible information. Today, ...
متن کاملSelf-Organizing Map for the Prize-Collecting Traveling Salesman Problem
In this paper, we propose novel adaptation rules for the selforganizing map to solve the prize-collecting traveling salesman problem (PC-TSP). The goal of the PC-TSP is to find a cost-efficient tour to collect prizes by visiting a subset of a given set of locations. In contrast with the classical traveling salesman problem, where all given locations must be visited, locations in the PC-TSP may ...
متن کاملPrize-collecting Network Design on Planar Graphs
In this paper, we reduce Prize-Collecting Steiner TSP (PCTSP), Prize-Collecting Stroll (PCS), Prize-Collecting Steiner Tree (PCST), Prize-Collecting Steiner Forest (PCSF) and more generally Submodular Prize-Collecting Steiner Forest (SPCSF) on planar graphs (and more generally bounded-genus graphs) to the same problems on graphs of bounded treewidth. More precisely, we show any α-approximation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Stata Journal: Promoting communications on statistics and Stata
سال: 2014
ISSN: 1536-867X,1536-8734
DOI: 10.1177/1536867x1401400415